By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 33, Issue 3, pp. 505-760

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Universal Classes of Extremely Random Constant-Time Hash Functions

Alan Siegel

pp. 505-543

Local Search Heuristics for k-Median and Facility Location Problems

Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit

pp. 544-562

Buffer Overflow Management in QoS Switches

Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, and Maxim Sviridenko

pp. 563-583

On the Frame--Stewart Conjecture about the Towers of Hanoi

Xiao Chen and Jian Shen

pp. 584-589

Incomplete Directed Perfect Phylogeny

Itsik Pe'er, Tal Pupko, Ron Shamir, and Roded Sharan

pp. 590-607

$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs

Michael Elkin and David Peleg

pp. 608-631

OPT Versus LOAD in Dynamic Storage Allocation

Adam L. Buchsbaum, Howard Karloff, Claire Kenyon, Nick Reingold, and Mikkel Thorup

pp. 632-646

Distances and Finger Search in Random Binary Search Trees

Luc Devroye and Ralph Neininger

pp. 647-658

The Effects of Temporary Sessions on Network Performance

Matthew Andrews and Lisa Zhang

pp. 659-673

Complete Axiomatizations for Reasoning about Knowledge and Time

Joseph Y. Halpern, Ron van der Meyden, and Moshe Y. Vardi

pp. 674-703

Hardness of Approximation for Vertex-Connectivity Network Design Problems

Guy Kortsarz, Robert Krauthgamer, and James R. Lee

pp. 704-720

The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree

Michael Molloy

pp. 721-737

Quantum Computation and Lattice Problems

Oded Regev

pp. 738-760